<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="utf-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1">
    <META NAME="ROBOTS" CONTENT="NOINDEX, NOFOLLOW">
    <link rel="icon" href="../images/logo/logo.png" type="image/x-icon">
    <link rel="shortcut icon" href="../images/logo/logo.png"
          type="image/x-icon">
    <title>浏阳德塔软件开发有限公司 女娲计划</title>
</head>
<body style="Max-width: 700px; text-align:center; margin:auto;">
<div style="text-align:left; Max-width: 680px; margin-left:15px;">
    <a href="../">上一页</a>
    <br/>
    <br/>
    <br/>第二章 Java 数据分析算法引擎系统
    <br/> 作者: 罗瑶光, Author:Yaoguang.Luo<br/>
    <br/>
    <br/>基础应用: 元基催化与肽计算 编译机的仿生分析机
    <br/>

    <br/>排序
    <br/>
    <br/>1 德塔的排序作者早期2009年设计《算法导论》 黑皮书, 北邮出版社有其 数据结构 影印教材
    的 快速排序4代, 进行了10年优化, refer page https://github.com/yaoguangluo/
    Data_Processor/blob/master/DP/sortProcessor/Quick_4D_Sort.java
    <br/>
    <br/>2 优化过程归纳, 逐渐的形成了一个微分催化排序体系. refer page 247, 248, 250,
    658, 下册134,
    <br/>
    <br/>3 左右比对算法优化, 小高峰过滤优化, 缺陷峰归纳, 催化算子优化, 离散逻辑优化. refer
    page 658, 下册134,
    <br/>
    <br/>左右比对算法优化, 一般指在不对称的数列中, 为了寻找对称性观测面, 作者设计了一种比较
    简单的方法, 如将数列逐渐拆分, 取出拆分后的小数列的初值和尾值进行比较, 作为一个参照点,
    用于躲避计算高峰. 测试发现具有强大的实用性.
    <br/>
    <br/>小高峰过滤优化, 一般指为了躲避内存计算高峰而导致的延迟, 卡顿, 死锁, 堆栈溢出等问题
    而设计的一类高效率算法集合.
    <br/>
    <br/>缺陷峰归纳, 一般指计算数列在不断的拆分中的中值基偶问题导致了变量, 算子, 函数的使用
    频率不对称而出现的一系列蝴蝶效应问题集的归纳.
    <br/>
    <br/>催化算子优化, 一般指 计算的中间过程中 因 变量, 算子, 函数的使用频率 不对称, 不稳定
    导致的各种问题, 为了解决这类问题而 进行的不断 的对 变量, 算子, 函数优化与校正过程.
    <br/>
    <br/>离散逻辑优化, 一般指 对 变量, 算子, 函数优化与校正过程中 通过离散数学, 迪摩根定律,
    等客观存在的逻辑定律进行 不断优化与校正过程. 定义人 罗瑶光
    <br/>
    <br/>Implements of Deta catalytic sort.
    <br/>
    <br/>The raw material of Deta catalytic sort was Quicksort4D, 2009
    from <
    <Introduction to Algorithms>>, and Its refer page: <br/>
        <br/>
        http://staff.ustc.edu.cn/~csli/graduate/algorithms/book6/chap08.htm.
        Theory <br/>
        <br/>
        https://oi-wiki.org/basic/quick-sort/. Theory <br/>
        <br/>
        Its optimizations gradually became a catalytic sorting system. Such as
        left and right marching, inner and small peak filtering, defect peak
        induction, and discrete logic optimization etc. <br/>
        <br/>
        Left and right marching, a mainly in an asymmetric and unregular array,
        in order to find a symmetric observation. The author separated
        main-array out of inner-array sections and where found a max value
        between a Left prefix and right post-tail. Then did conditional
        performs to avoid the high peak of computing. It seems much more
        important about reliabilities. <br/>
        <br/>
        Inner and small peak filtering, a mainly collections of high-effect
        algorithms, which in order to avoid problems such as the CPU lazy, net
        gate laggy, DMA crash and Memory out of stack. <br/>
        <br/>
        Defect peak induction, a mainly problem’s induction, in an asymmetric
        and irregular statement. Meant a butterfly effect of Defect computing
        problems of middle sets, values, functions and asserts. <br/>
        <br/>
        Catalytic sets optimization, a mainly a collection of optimizations to
        resolve this defect computing problem of above middle sets, values,
        functions and asserts. <br/>
        <br/>
        Discrete logic optimization, a mainly a collection of algorithms to
        provide a catalytic optimization about above middle sets, values,
        functions and asserts. These algorithms included Discrete Mathematics,
        Demorgan Algebra, Objectives and Nature-Definitions. <br/>
        <br/>
        The author YaoguangLuo 稍后优化语法 <br/>
        <br/>
        4 目前代表作为TopSort5D 极速催化排序. refer page 下册134 <br/>
        <br/>

</div>
</body>